<!--
Copyright Louis Dionne 2013-2016
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
-->
<!-- boost-no-inspect -->
<!-- HTML header for doxygen 1.8.9.1-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.11"/>
<title>Boost.Hana: boost/hana Directory Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<script type="text/x-mathjax-config">
  MathJax.Hub.Config({
    extensions: ["tex2jax.js"],
    jax: ["input/TeX","output/HTML-CSS"],
});
// Copyright Louis Dionne 2013-2016
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
MathJax.Hub.Config({
    "HTML-CSS": {
        linebreaks: {
            automatic: true,
            width: "75% container"
        }
    }
});
</script><script type="text/javascript" src="https://cdn.mathjax.org/mathjax/latest/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<!-- Additional javascript for drawing charts. -->
<script type="text/javascript" src="highcharts.js"></script>
<script type="text/javascript" src="highcharts-data.js"></script>
<script type="text/javascript" src="highcharts-exporting.js"></script>
<script type="text/javascript" src="chart.js"></script>
<script type="text/javascript" src="hana.js"></script>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="Boost.png"/></td>
  <td style="padding-left: 0.5em;">
   <div id="projectname">Boost.Hana
   &#160;<span id="projectnumber">1.0.2</span>
   </div>
   <div id="projectbrief">Your standard library for metaprogramming</div>
  </td>
   <td>        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)"
               onblur="searchBox.OnSearchFieldFocus(false)"
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
</td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.11 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;"
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('dir_daf74c896eae580804ddb7810f485dad.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">hana Directory Reference</div>  </div>
</div><!--header-->
<div class="contents">
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="subdirs"></a>
Directories</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="files"></a>
Files</h2></td></tr>
<tr class="memitem:accessors_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="accessors_8hpp.html">accessors.hpp</a></td></tr>
<tr class="memdesc:accessors_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Struct.html#ga983a55dbd93d766fd37689ea32e4ddfb" title="Returns a Sequence of pairs representing the accessors of the data structure.Given a Struct S...">boost::hana::accessors</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adapt__adt_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="adapt__adt_8hpp.html">adapt_adt.hpp</a></td></tr>
<tr class="memdesc:adapt__adt_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines the <code>BOOST_HANA_ADAPT_ADT</code> macro. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adapt__struct_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="adapt__struct_8hpp.html">adapt_struct.hpp</a></td></tr>
<tr class="memdesc:adapt__struct_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines the <code>BOOST_HANA_ADAPT_STRUCT</code> macro. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adjust_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="adjust_8hpp.html">adjust.hpp</a></td></tr>
<tr class="memdesc:adjust_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Functor.html#ga7cc731e67ebc1f5303be1a97b2d5e0cd" title="Apply a function on all the elements of a structure that compare equal to some value. ">boost::hana::adjust</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adjust__if_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="adjust__if_8hpp.html">adjust_if.hpp</a></td></tr>
<tr class="memdesc:adjust__if_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Functor.html#gaa0490f57047c1b0d75fbe233688358f4" title="Apply a function on all the elements of a structure satisfying a predicate.Given a Functor...">boost::hana::adjust_if</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:all_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="all_8hpp.html">all.hpp</a></td></tr>
<tr class="memdesc:all_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Searchable.html#ga81ae9764dd7818ad36270c6419fb1082" title="Returns whether all the keys of the structure are true-valued.The keys of the structure must be Logic...">boost::hana::all</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:all__of_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="all__of_8hpp.html">all_of.hpp</a></td></tr>
<tr class="memdesc:all__of_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Searchable.html#ga3a168950082f38afd9edf256f336c8ba" title="Returns whether all the keys of the structure satisfy the predicate.If the structure is not finite...">boost::hana::all_of</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:and_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="and_8hpp.html">and.hpp</a></td></tr>
<tr class="memdesc:and_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Logical.html#ga14066f5672867c123524e0e0978069eb" title="Return whether all the arguments are true-valued.and_ can be called with one argument or more...">boost::hana::and_</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:any_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="any_8hpp.html">any.hpp</a></td></tr>
<tr class="memdesc:any_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Searchable.html#gab7d632b9319b10b1eb7e98f9e1cf8a28" title="Returns whether any key of the structure is true-valued.The keys of the structure must be Logicals...">boost::hana::any</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:any__of_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="any__of_8hpp.html">any_of.hpp</a></td></tr>
<tr class="memdesc:any__of_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Searchable.html#ga5f7ff0125c448983e1b96c3ffb84f646" title="Returns whether any key of the structure satisfies the predicate.If the structure is not finite...">boost::hana::any_of</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ap_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="ap_8hpp.html">ap.hpp</a></td></tr>
<tr class="memdesc:ap_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Applicative.html#ga6176a32953dbbdee96e3ab3c73e4c890" title="Lifted application.Specifically, ap applies a structure containing functions to a structure containin...">boost::hana::ap</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:append_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="append_8hpp.html">append.hpp</a></td></tr>
<tr class="memdesc:append_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-MonadPlus.html#ga08624924fe05f0cfbfbd6e439db01873" title="Append an element to a monadic structure.Given an element x and a monadic structure xs...">boost::hana::append</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:assert_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="assert_8hpp.html">assert.hpp</a></td></tr>
<tr class="memdesc:assert_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines macros to perform different kinds of assertions. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:at_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="at_8hpp.html">at.hpp</a></td></tr>
<tr class="memdesc:at_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Iterable.html#ga8a484304380eae38f3d9663d98860129" title="Returns the nth element of an iterable.Given an Iterable and an IntegralConstant index, at returns the element located at the index in the linearization of the iterable. Specifically, given an iterable xs with a linearization of [x1, ..., xN], at(xs, k) is equivalent to xk. ">boost::hana::at</a></code> and <code><a class="el" href="group__group-Iterable.html#ga4cb99cfbef936cb267e76f66f40f529c" title="Equivalent to at; provided for convenience. ">boost::hana::at_c</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:at__key_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="at__key_8hpp.html">at_key.hpp</a></td></tr>
<tr class="memdesc:at__key_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Searchable.html#ga3c1826aee6c6eb577810bb99c5c3e53d" title="Returns the value associated to the given key in a structure, or fail.Given a key and a Searchable st...">boost::hana::at_key</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:back_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="back_8hpp.html">back.hpp</a></td></tr>
<tr class="memdesc:back_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Iterable.html#gab3f4d0035345a453284e46303862d463" title="Returns the last element of a non-empty and finite iterable.Given a non-empty and finite iterable xs ...">boost::hana::back</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:basic__tuple_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="basic__tuple_8hpp.html">basic_tuple.hpp</a></td></tr>
<tr class="memdesc:basic__tuple_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="structboost_1_1hana_1_1basic__tuple.html" title="Stripped down version of hana::tuple. ">boost::hana::basic_tuple</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:bool_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="bool_8hpp.html">bool.hpp</a></td></tr>
<tr class="memdesc:bool_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines the <code>Logical</code> and <code>Comparable</code> models of <code><a class="el" href="structboost_1_1hana_1_1integral__constant.html" title="Compile-time value of an integral type. ">boost::hana::integral_constant</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:cartesian__product_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="cartesian__product_8hpp.html">cartesian_product.hpp</a></td></tr>
<tr class="memdesc:cartesian__product_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga66599f0e1f0749daba759dc661946bdc" title="Computes the cartesian product of a sequence of sequences.Given a sequence of sequences, cartesian_product returns a new sequence of sequences containing the cartesian product of the original sequences. For this method to finish, a finite number of finite sequences must be provided. ">boost::hana::cartesian_product</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:chain_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="chain_8hpp.html">chain.hpp</a></td></tr>
<tr class="memdesc:chain_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Monad.html#ga05fdc2f887cb9967357487a432ace98b" title="Feed a monadic value into a monadic computation.Given a monadic value and a monadic function...">boost::hana::chain</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:comparing_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="comparing_8hpp.html">comparing.hpp</a></td></tr>
<tr class="memdesc:comparing_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Comparable.html#ga9c2ffe2e51780e57a38d9e7e31b87cdc" title="Returns a function performing equal after applying a transformation to both arguments.comparing creates an equivalence relation based on the result of applying a function to some objects, which is especially useful in conjunction with algorithms that accept a custom predicate that must represent an equivalence relation. ">boost::hana::comparing</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:concat_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="concat_8hpp.html">concat.hpp</a></td></tr>
<tr class="memdesc:concat_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-MonadPlus.html#ga1946e96c3b4c178c7ae8703724c29c37" title="Combine two monadic structures together.Given two monadic structures, concat combines them together a...">boost::hana::concat</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:concept_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="concept_8hpp.html">concept.hpp</a></td></tr>
<tr class="memdesc:concept_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Master header for the <code>boost/hana/concept/</code> subdirectory. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:config_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="config_8hpp.html">config.hpp</a></td></tr>
<tr class="memdesc:config_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines configuration macros used throughout the library. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:contains_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="contains_8hpp.html">contains.hpp</a></td></tr>
<tr class="memdesc:contains_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Searchable.html#ga38e7748956cbc9f3d9bb035ac8577906" title="Returns whether the key occurs in the structure.Given a Searchable structure xs and a key...">boost::hana::contains</a></code> and <code><a class="el" href="group__group-Searchable.html#ga0d9456ceda38b6ca664998e79d7c45b7" title="Return whether the key occurs in the structure.Specifically, this is equivalent to contains...">boost::hana::in</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:core_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="core_8hpp.html">core.hpp</a></td></tr>
<tr class="memdesc:core_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines the <a class="el" href="group__group-core.html">Core</a> module. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:count_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="count_8hpp.html">count.hpp</a></td></tr>
<tr class="memdesc:count_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#ga3159cfa41be18a396926741b0a3fdefd" title="Return the number of elements in the structure that compare equal to a given value.Given a Foldable structure xs and a value value, count returns an unsigned integral, or a Constant thereof, representing the number of elements of xs that compare equal to value. For this method to be well-defined, all the elements of the structure must be Comparable with the given value. ">boost::hana::count</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:count__if_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="count__if_8hpp.html">count_if.hpp</a></td></tr>
<tr class="memdesc:count__if_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#ga39d71be65d5b98e7d035a3e5c607e1b4" title="Return the number of elements in the structure for which the predicate is satisfied.Specifically, returns an object of an unsigned integral type, or a Constant holding such an object, which represents the number of elements in the structure satisfying the given predicate. ">boost::hana::count_if</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:cycle_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="cycle_8hpp.html">cycle.hpp</a></td></tr>
<tr class="memdesc:cycle_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-MonadPlus.html#gaaf46c168f721da9effcc7336a997f5d6" title="Combine a monadic structure with itself n times.Given a monadic structure xs and a non-negative numbe...">boost::hana::cycle</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:define__struct_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="define__struct_8hpp.html">define_struct.hpp</a></td></tr>
<tr class="memdesc:define__struct_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines the <code>BOOST_HANA_DEFINE_STRUCT</code> macro. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:difference_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="difference_8hpp.html">difference.hpp</a></td></tr>
<tr class="memdesc:difference_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code>boost::hana::difference</code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:div_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="div_8hpp.html">div.hpp</a></td></tr>
<tr class="memdesc:div_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-EuclideanRing.html#ga4225a7988ce98903228913dde53762df" title="Generalized integer division. ">boost::hana::div</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:drop__back_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="drop__back_8hpp.html">drop_back.hpp</a></td></tr>
<tr class="memdesc:drop__back_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#gac10231310abc86b056585ea0d0e96ef7" title="Drop the last n elements of a finite sequence, and return the rest.Given a finite Sequence xs with a ...">boost::hana::drop_back</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:drop__front_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="drop__front_8hpp.html">drop_front.hpp</a></td></tr>
<tr class="memdesc:drop__front_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Iterable.html#gad23ce0a4906e2bb0a52f38837b134757" title="Drop the first n elements of an iterable, and return the rest.Given an Iterable xs with a linearizati...">boost::hana::drop_front</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:drop__front__exactly_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="drop__front__exactly_8hpp.html">drop_front_exactly.hpp</a></td></tr>
<tr class="memdesc:drop__front__exactly_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Iterable.html#ga4dbc6a82f03ca35b7ac418ca30889cc4" title="Drop the first n elements of an iterable, and return the rest.Given an Iterable xs with a linearizati...">boost::hana::drop_front_exactly</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:drop__while_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="drop__while_8hpp.html">drop_while.hpp</a></td></tr>
<tr class="memdesc:drop__while_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Iterable.html#ga9f1d02c74a6bdc1db260e0d6a8f1ee56" title="Drop elements from an iterable up to, but excluding, the first element for which the predicate is not...">boost::hana::drop_while</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:duplicate_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="duplicate_8hpp.html">duplicate.hpp</a></td></tr>
<tr class="memdesc:duplicate_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Comonad.html#ga181751278bd19a4bfc3c08bd7ddef399" title="Add an extra layer of comonadic context to a comonadic value.Given a value already in a comonadic con...">boost::hana::duplicate</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:empty_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="empty_8hpp.html">empty.hpp</a></td></tr>
<tr class="memdesc:empty_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-MonadPlus.html#gaa6be1e83ad72b9d69b43b4bada0f3a75" title="Identity of the monadic combination concat.Signature Given a MonadPlus M, the signature is ...">boost::hana::empty</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:equal_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="equal_8hpp.html">equal.hpp</a></td></tr>
<tr class="memdesc:equal_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Comparable.html#gacaf1ebea6b3ab96ac9dcb82f0e64e547" title="Returns a Logical representing whether x is equal to y.The equal function can be called in two differ...">boost::hana::equal</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:erase__key_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="erase__key_8hpp.html">erase_key.hpp</a></td></tr>
<tr class="memdesc:erase__key_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code>boost::hana::erase_key</code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:eval_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="eval_8hpp.html">eval.hpp</a></td></tr>
<tr class="memdesc:eval_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code>boost::hana::eval</code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:eval__if_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="eval__if_8hpp.html">eval_if.hpp</a></td></tr>
<tr class="memdesc:eval__if_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Logical.html#gab64636f84de983575aac0208f5fa840c" title="Conditionally execute one of two branches based on a condition.Given a condition and two branches in ...">boost::hana::eval_if</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:extend_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="extend_8hpp.html">extend.hpp</a></td></tr>
<tr class="memdesc:extend_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Comonad.html#gaf44692351fd9fe4e76815dfef6ff4478" title="Comonadic application of a function to a comonadic value.Given a comonadic value and a function accep...">boost::hana::extend</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:extract_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="extract_8hpp.html">extract.hpp</a></td></tr>
<tr class="memdesc:extract_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Comonad.html#ga307479a91a21b7ab06a2bc746b003dcc" title="Extract a value in a given comonadic context.Given a value inside a comonadic context, extract it from that context, performing whatever effects are mandated by that context. This can be seen as the dual operation to the lift method of the Applicative concept. ">boost::hana::extract</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:fill_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="fill_8hpp.html">fill.hpp</a></td></tr>
<tr class="memdesc:fill_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Functor.html#ga2ce68d315f981ef35751c4dc25ad5642" title="Replace all the elements of a structure with a fixed value. ">boost::hana::fill</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:filter_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="filter_8hpp.html">filter.hpp</a></td></tr>
<tr class="memdesc:filter_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-MonadPlus.html#ga65cc6d9f522fb9e8e3b28d80ee5c822a" title="Filter a monadic structure using a custom predicate.Given a monadic structure and a predicate...">boost::hana::filter</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:find_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="find_8hpp.html">find.hpp</a></td></tr>
<tr class="memdesc:find_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Searchable.html#ga6b6cdd69942b0fe3bf5254247f9c861e" title="Finds the value associated to the given key in a structure.Given a key and a Searchable structure...">boost::hana::find</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:find__if_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="find__if_8hpp.html">find_if.hpp</a></td></tr>
<tr class="memdesc:find__if_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Searchable.html#ga7f99b80672aa80a7eb8b223955ce546f" title="Finds the value associated to the first key satisfying a predicate.Given a Searchable structure xs an...">boost::hana::find_if</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:first_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="first_8hpp.html">first.hpp</a></td></tr>
<tr class="memdesc:first_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Product.html#ga34bbf4281de06dc3540441e8b2bd24f4" title="Returns the first element of a pair.Note that if the Product actually stores the elements it contains...">boost::hana::first</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:flatten_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="flatten_8hpp.html">flatten.hpp</a></td></tr>
<tr class="memdesc:flatten_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Monad.html#gaa5fec6fb418de5da3ecb500fd6cc54dd" title="Collapse two levels of monadic structure into a single level.Given a monadic value wrapped into two l...">boost::hana::flatten</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:fold_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="fold_8hpp.html">fold.hpp</a></td></tr>
<tr class="memdesc:fold_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#gaa0fde17f3b947a0678a1c0c01232f2cc" title="Equivalent to fold_left; provided for convenience.fold is equivalent to fold_left. However, it is not tag-dispatched on its own because it is just an alias to fold_left. Also note that fold can be called with or without an initial state, just like fold_left: ">boost::hana::fold</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:fold__left_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="fold__left_8hpp.html">fold_left.hpp</a></td></tr>
<tr class="memdesc:fold__left_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#ga38c6b3f6b1cbadb9b8432a05ff16b7d2" title="Left-fold of a structure using a binary operation and an optional initial reduction state...">boost::hana::fold_left</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:fold__right_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="fold__right_8hpp.html">fold_right.hpp</a></td></tr>
<tr class="memdesc:fold__right_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#ga77d43badebd59b046cf93598733649b4" title="Right-fold of a structure using a binary operation and an optional initial reduction state...">boost::hana::fold_right</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:for__each_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="for__each_8hpp.html">for_each.hpp</a></td></tr>
<tr class="memdesc:for__each_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#ga2af382f7e644ce3707710bbad313e9c2" title="Perform an action on each element of a foldable, discarding the result each time.Iteration is done fr...">boost::hana::for_each</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:front_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="front_8hpp.html">front.hpp</a></td></tr>
<tr class="memdesc:front_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Iterable.html#ga8a67ea10e8082dbe6705e573fa978444" title="Returns the first element of a non-empty iterable.Given a non-empty Iterable xs with a linearization ...">boost::hana::front</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:functional_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="functional_8hpp.html">functional.hpp</a></td></tr>
<tr class="memdesc:functional_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines the <a class="el" href="group__group-functional.html">Functional</a> module. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:fuse_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="fuse_8hpp.html">fuse.hpp</a></td></tr>
<tr class="memdesc:fuse_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#ga19fcf61d8d1179903952c0f564c538aa" title="Transform a function taking multiple arguments into a function that can be called with a compile-time...">boost::hana::fuse</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:greater_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="greater_8hpp.html">greater.hpp</a></td></tr>
<tr class="memdesc:greater_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Orderable.html#gaf9a073eafebbe514fb19dff82318f198" title="Returns a Logical representing whether x is greater than y. ">boost::hana::greater</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:greater__equal_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="greater__equal_8hpp.html">greater_equal.hpp</a></td></tr>
<tr class="memdesc:greater__equal_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Orderable.html#ga6023631e7d0a01e16dc3fa4221fbd703" title="Returns a Logical representing whether x is greater than or equal to y. ">boost::hana::greater_equal</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:group_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group_8hpp.html">group.hpp</a></td></tr>
<tr class="memdesc:group_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#gacefca884b3580664b63238cf8ba33fd3" title="Group adjacent elements of a sequence that all respect a binary predicate, by default equality...">boost::hana::group</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:hash_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="hash_8hpp.html">hash.hpp</a></td></tr>
<tr class="memdesc:hash_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Hashable.html#ga6e906f44f47b210615491385e5c8a7b5" title="Returns a hana::type representing the compile-time hash of an object.Given an arbitrary object x...">boost::hana::hash</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:if_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="if_8hpp.html">if.hpp</a></td></tr>
<tr class="memdesc:if_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Logical.html#gafd655d2222367131e7a63616e93dd080" title="Conditionally return one of two values based on a condition.Specifically, then is returned iff cond i...">boost::hana::if_</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:insert_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="insert_8hpp.html">insert.hpp</a></td></tr>
<tr class="memdesc:insert_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#gae22a1a184b1b2dd550fa4fa619bed2e9" title="Insert a value at a given index in a sequence.Given a sequence, an index and an element to insert...">boost::hana::insert</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:insert__range_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="insert__range_8hpp.html">insert_range.hpp</a></td></tr>
<tr class="memdesc:insert__range_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga3410ba833cf1ff1d929fcfda4df2eae1" title="Insert several values at a given index in a sequence.Given a sequence, an index and any Foldable cont...">boost::hana::insert_range</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:integral__constant_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="integral__constant_8hpp.html">integral_constant.hpp</a></td></tr>
<tr class="memdesc:integral__constant_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="structboost_1_1hana_1_1integral__constant.html" title="Compile-time value of an integral type. ">boost::hana::integral_constant</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:intersection_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="intersection_8hpp.html">intersection.hpp</a></td></tr>
<tr class="memdesc:intersection_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code>boost::hana::intersection</code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:intersperse_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="intersperse_8hpp.html">intersperse.hpp</a></td></tr>
<tr class="memdesc:intersperse_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#gaa18061cd0f63cfaae89abf43ff92b79e" title="Insert a value between each pair of elements in a finite sequence.Given a finite Sequence xs with a l...">boost::hana::intersperse</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:is__disjoint_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="is__disjoint_8hpp.html">is_disjoint.hpp</a></td></tr>
<tr class="memdesc:is__disjoint_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Searchable.html#ga3b8269d4f5cdd6dd549fae32280795a0" title="Returns whether two Searchables are disjoint.Given two Searchables xs and ys, is_disjoint returns a L...">boost::hana::is_disjoint</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:is__empty_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="is__empty_8hpp.html">is_empty.hpp</a></td></tr>
<tr class="memdesc:is__empty_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Iterable.html#ga2a05f564f8a7e4afa04fcbc07ad8f394" title="Returns whether the iterable is empty.Given an Iterable xs, is_empty returns whether xs contains no m...">boost::hana::is_empty</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:is__subset_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="is__subset_8hpp.html">is_subset.hpp</a></td></tr>
<tr class="memdesc:is__subset_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Searchable.html#gadccfc79f1acdd8043d2baa16df16ec9f" title="Returns whether a structure contains a subset of the keys of another structure.Given two Searchables ...">boost::hana::is_subset</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:keys_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="keys_8hpp.html">keys.hpp</a></td></tr>
<tr class="memdesc:keys_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Struct.html#gaf8c7199742581e6e66c8397def68e2d3" title="Returns a Sequence containing the name of the members of the data structure.Given a Struct object...">boost::hana::keys</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:lazy_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="lazy_8hpp.html">lazy.hpp</a></td></tr>
<tr class="memdesc:lazy_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="structboost_1_1hana_1_1lazy.html" title="hana::lazy implements superficial laziness via a monadic interface. ">boost::hana::lazy</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:length_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="length_8hpp.html">length.hpp</a></td></tr>
<tr class="memdesc:length_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#gaf0f8f717245620dc28cd7d7fa44d7475" title="Return the number of elements in a foldable structure.Given a Foldable xs, length(xs) must return an ...">boost::hana::length</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:less_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="less_8hpp.html">less.hpp</a></td></tr>
<tr class="memdesc:less_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Orderable.html#gad510011602bdb14686f1c4ec145301c9" title="Returns a Logical representing whether x is less than y. ">boost::hana::less</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:less__equal_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="less__equal_8hpp.html">less_equal.hpp</a></td></tr>
<tr class="memdesc:less__equal_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Orderable.html#ga9917dd82beb67151bf5657245d37b851" title="Returns a Logical representing whether x is less than or equal to y. ">boost::hana::less_equal</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:lexicographical__compare_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="lexicographical__compare_8hpp.html">lexicographical_compare.hpp</a></td></tr>
<tr class="memdesc:lexicographical__compare_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Iterable.html#ga660b2649d63ac71dacc64c3852c981e5" title="Short-circuiting lexicographical comparison of two Iterables with an optional custom predicate...">boost::hana::lexicographical_compare</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:lift_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="lift_8hpp.html">lift.hpp</a></td></tr>
<tr class="memdesc:lift_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Applicative.html#ga712038d7abbc7159f8792788f7cd0c73" title="Lift a value into an Applicative structure.lift&lt;A&gt; takes a normal value and embeds it into a structur...">boost::hana::lift</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:map_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="map_8hpp.html">map.hpp</a></td></tr>
<tr class="memdesc:map_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="structboost_1_1hana_1_1map.html" title="Basic associative container requiring unique, Comparable and Hashable keys. ">boost::hana::map</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:max_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="max_8hpp.html">max.hpp</a></td></tr>
<tr class="memdesc:max_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Orderable.html#ga999eee8ca8750f9b1afa0d7a1db28030" title="Returns the greatest of its arguments according to the less ordering. ">boost::hana::max</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:maximum_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="maximum_8hpp.html">maximum.hpp</a></td></tr>
<tr class="memdesc:maximum_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#gaf3861a91607203b63a12708e18a4eac5" title="Return the greatest element of a non-empty structure with respect to a predicate, by default less...">boost::hana::maximum</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:members_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="members_8hpp.html">members.hpp</a></td></tr>
<tr class="memdesc:members_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Struct.html#gad301dd8e9fb4639d7874619c97d6d427" title="Returns a Sequence containing the members of a Struct.Given a Struct object, members returns a Sequen...">boost::hana::members</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:min_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="min_8hpp.html">min.hpp</a></td></tr>
<tr class="memdesc:min_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Orderable.html#ga2d54f189ea6f57fb2c0d772169440c5c" title="Returns the smallest of its arguments according to the less ordering. ">boost::hana::min</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:minimum_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="minimum_8hpp.html">minimum.hpp</a></td></tr>
<tr class="memdesc:minimum_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#ga347429451fdb15f9f7a7fc0de293be1a" title="Return the least element of a non-empty structure with respect to a predicate, by default less...">boost::hana::minimum</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:minus_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="minus_8hpp.html">minus.hpp</a></td></tr>
<tr class="memdesc:minus_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Group.html#ga2020c526324f361a2b990fe8d1b07c20" title="Subtract two elements of a group.Specifically, this performs the Monoid operation on the first argume...">boost::hana::minus</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:mod_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="mod_8hpp.html">mod.hpp</a></td></tr>
<tr class="memdesc:mod_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-EuclideanRing.html#ga9b47b223d5b02db933b3c93b5bd1a062" title="Generalized integer modulus.Given two elements of an EuclideanRing x and y, with y nonzero...">boost::hana::mod</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:monadic__compose_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="monadic__compose_8hpp.html">monadic_compose.hpp</a></td></tr>
<tr class="memdesc:monadic__compose_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Monad.html#gaec3fe26c7378fd3057af83e03bd9b104" title="Composition of monadic functions.Given two monadic functions f and g, monadic_compose returns a new f...">boost::hana::monadic_compose</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:monadic__fold__left_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="monadic__fold__left_8hpp.html">monadic_fold_left.hpp</a></td></tr>
<tr class="memdesc:monadic__fold__left_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#gac14edbff755244aa02b57a6383dcebc6" title="Monadic left-fold of a structure with a binary operation and an optional initial reduction state...">boost::hana::monadic_fold_left</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:monadic__fold__right_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="monadic__fold__right_8hpp.html">monadic_fold_right.hpp</a></td></tr>
<tr class="memdesc:monadic__fold__right_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#gaa058d91f3e1294f0d3c71bedf33e2360" title="Monadic right-fold of a structure with a binary operation and an optional initial reduction state...">boost::hana::monadic_fold_right</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:mult_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="mult_8hpp.html">mult.hpp</a></td></tr>
<tr class="memdesc:mult_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Ring.html#ga052d31c269a6a438cc8004c9ad1efdfa" title="Associative operation of a Ring. ">boost::hana::mult</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:negate_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="negate_8hpp.html">negate.hpp</a></td></tr>
<tr class="memdesc:negate_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Group.html#ga02e81002f40ba52eac4cf1974c7e0cdb" title="Return the inverse of an element of a group. ">boost::hana::negate</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:none_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="none_8hpp.html">none.hpp</a></td></tr>
<tr class="memdesc:none_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Searchable.html#ga614ff1e575806f59246b17006e19d479" title="Returns whether all of the keys of the structure are false-valued.The keys of the structure must be L...">boost::hana::none</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:none__of_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="none__of_8hpp.html">none_of.hpp</a></td></tr>
<tr class="memdesc:none__of_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Searchable.html#ga43954c791b5b1351fb009e2a643d00f5" title="Returns whether none of the keys of the structure satisfy the predicate.If the structure is not finit...">boost::hana::none_of</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:not_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="not_8hpp.html">not.hpp</a></td></tr>
<tr class="memdesc:not_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Logical.html#ga4a7c9d7037601d5e553fd20777958980" title="Negates a Logical.This method returns a Logical with the same tag, but whose truth-value is negated...">boost::hana::not_</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:not__equal_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="not__equal_8hpp.html">not_equal.hpp</a></td></tr>
<tr class="memdesc:not__equal_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Comparable.html#gae33be2e0d5e04f19082f4b7740dfc9cd" title="Returns a Logical representing whether x is not equal to y.The not_equal function can be called in tw...">boost::hana::not_equal</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:one_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="one_8hpp.html">one.hpp</a></td></tr>
<tr class="memdesc:one_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Ring.html#gadea531feb3b0a1c5c3d777f7ab45e932" title="Identity of the Ring multiplication. ">boost::hana::one</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:optional_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="optional_8hpp.html">optional.hpp</a></td></tr>
<tr class="memdesc:optional_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="structboost_1_1hana_1_1optional.html" title="Optional value whose optional-ness is known at compile-time. ">boost::hana::optional</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:or_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="or_8hpp.html">or.hpp</a></td></tr>
<tr class="memdesc:or_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Logical.html#ga68c00efbeb69339bfa157a78ebdd3f87" title="Return whether any of the arguments is true-valued.or_ can be called with one argument or more...">boost::hana::or_</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ordering_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="ordering_8hpp.html">ordering.hpp</a></td></tr>
<tr class="memdesc:ordering_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Orderable.html#gaf7e94ba859710cd6ba6152e5dc18977d" title="Returns a function performing less after applying a transformation to both arguments.ordering creates a total order based on the result of applying a function to some objects, which is especially useful in conjunction with algorithms that accept a custom predicate that must represent a total order. ">boost::hana::ordering</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:pair_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pair_8hpp.html">pair.hpp</a></td></tr>
<tr class="memdesc:pair_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="structboost_1_1hana_1_1pair.html" title="Generic container for two elements. ">boost::hana::pair</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:partition_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="partition_8hpp.html">partition.hpp</a></td></tr>
<tr class="memdesc:partition_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga5e84ac3f1eb09c637b6b38ef42dccd8d" title="Partition a sequence based on a predicate.Specifically, returns an unspecified Product whose first el...">boost::hana::partition</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:permutations_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="permutations_8hpp.html">permutations.hpp</a></td></tr>
<tr class="memdesc:permutations_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#gac1e182ac088f1990edd739424d30ea07" title="Return a sequence of all the permutations of the given sequence.Specifically, permutations(xs) is a s...">boost::hana::permutations</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:plus_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="plus_8hpp.html">plus.hpp</a></td></tr>
<tr class="memdesc:plus_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Monoid.html#gaeb5d4a1e967e319712f9e4791948896c" title="Associative binary operation on a Monoid. ">boost::hana::plus</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:power_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="power_8hpp.html">power.hpp</a></td></tr>
<tr class="memdesc:power_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Ring.html#ga0ee3cff9ec646bcc7217f00ee6099b72" title="Elevate a ring element to its nth power.Specifically, power(x, n), is equivalent to multiplying x wit...">boost::hana::power</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:prefix_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="prefix_8hpp.html">prefix.hpp</a></td></tr>
<tr class="memdesc:prefix_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-MonadPlus.html#ga3022fdfe454dc9bc1f79b5dfeba13b5e" title="Inserts a value before each element of a monadic structure.Given a monadic structure xs and a value z...">boost::hana::prefix</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:prepend_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="prepend_8hpp.html">prepend.hpp</a></td></tr>
<tr class="memdesc:prepend_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-MonadPlus.html#ga69afbfd4e91125e3e52fcb409135ca7c" title="Prepend an element to a monadic structure.Given a monadic structure xs and an element x...">boost::hana::prepend</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:product_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="product_8hpp.html">product.hpp</a></td></tr>
<tr class="memdesc:product_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#ga17fe9c1982c882807f3358b4138c5744" title="Compute the product of the numbers of a structure.More generally, product will take any foldable stru...">boost::hana::product</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:range_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="range_8hpp.html">range.hpp</a></td></tr>
<tr class="memdesc:range_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="structboost_1_1hana_1_1range.html" title="Compile-time half-open interval of hana::integral_constants. ">boost::hana::range</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:remove_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="remove_8hpp.html">remove.hpp</a></td></tr>
<tr class="memdesc:remove_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-MonadPlus.html#gae3cc0d6e0d8feb3d677bd1da64da6f43" title="Remove all the elements of a monadic structure that are equal to some value.Given a monadic structure...">boost::hana::remove</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:remove__at_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="remove__at_8hpp.html">remove_at.hpp</a></td></tr>
<tr class="memdesc:remove__at_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga80724ec8ecf319a1e695988a69e22f87" title="Remove the element at a given index from a sequence.remove_at returns a new sequence identical to the...">boost::hana::remove_at</a></code> and <code><a class="el" href="group__group-Sequence.html#gae70b0815645c7d81bb636a1eed1a65c6" title="Equivalent to remove_at; provided for convenience. ">boost::hana::remove_at_c</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:remove__if_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="remove__if_8hpp.html">remove_if.hpp</a></td></tr>
<tr class="memdesc:remove__if_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-MonadPlus.html#ga9700169a45664d50377c1be9d58accd3" title="Remove all the elements of a monadic structure that satisfy some predicate.Given a monadic structure ...">boost::hana::remove_if</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:remove__range_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="remove__range_8hpp.html">remove_range.hpp</a></td></tr>
<tr class="memdesc:remove__range_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga6f6d5c1f335780c91d29626fde615c78" title="Remove the elements inside a given range of indices from a sequence.remove_range returns a new sequen...">boost::hana::remove_range</a></code> and <code><a class="el" href="group__group-Sequence.html#ga4696efcdee7d95ab4a391bb896a840b5" title="Equivalent to remove_range; provided for convenience. ">boost::hana::remove_range_c</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:repeat_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="repeat_8hpp.html">repeat.hpp</a></td></tr>
<tr class="memdesc:repeat_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="namespaceboost_1_1hana.html#a405f3dd84fc6f5003e64f8da104a1b54" title="Invokes a nullary function n times.Given an IntegralConstant n and a nullary function f...">boost::hana::repeat</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:replace_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="replace_8hpp.html">replace.hpp</a></td></tr>
<tr class="memdesc:replace_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Functor.html#ga94cd3a75d59d70d77cfce144c4acf8ab" title="Replace all the elements of a structure that compare equal to some value with some new fixed value...">boost::hana::replace</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:replace__if_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="replace__if_8hpp.html">replace_if.hpp</a></td></tr>
<tr class="memdesc:replace__if_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Functor.html#ga1d21b4bccd16367d164fbe0d9ef52150" title="Replace all the elements of a structure satisfying a predicate with a fixed value. ">boost::hana::replace_if</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:replicate_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="replicate_8hpp.html">replicate.hpp</a></td></tr>
<tr class="memdesc:replicate_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-MonadPlus.html#gad5f48c79d11923d6c1d70b18b7dd3f19" title="Create a monadic structure by combining a lifted value with itself n times.Given a value x...">boost::hana::replicate</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:reverse_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="reverse_8hpp.html">reverse.hpp</a></td></tr>
<tr class="memdesc:reverse_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga28037560e8f224c53cf6ac168d03a067" title="Reverse a sequence.Specifically, reverse(xs) is a new sequence containing the same elements as xs...">boost::hana::reverse</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:reverse__fold_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="reverse__fold_8hpp.html">reverse_fold.hpp</a></td></tr>
<tr class="memdesc:reverse__fold_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#ga947602718a53bd7fcd5c20477694cdcd" title="Equivalent to reverse_fold in Boost.Fusion and Boost.MPL.This method has the same semantics as revers...">boost::hana::reverse_fold</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:scan__left_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="scan__left_8hpp.html">scan_left.hpp</a></td></tr>
<tr class="memdesc:scan__left_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#gaec484fb349500149d90717f6e68f7bcd" title="Fold a Sequence to the left and return a list containing the successive reduction states...">boost::hana::scan_left</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:scan__right_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="scan__right_8hpp.html">scan_right.hpp</a></td></tr>
<tr class="memdesc:scan__right_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga54d141f901866dfab29b052857123bab" title="Fold a Sequence to the right and return a list containing the successive reduction states...">boost::hana::scan_right</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:second_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="second_8hpp.html">second.hpp</a></td></tr>
<tr class="memdesc:second_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Product.html#ga7bb979d59ffc3ab862cb7d9dc7730077" title="Returns the second element of a pair.Note that if the Product actually stores the elements it contain...">boost::hana::second</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:set_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="set_8hpp.html">set.hpp</a></td></tr>
<tr class="memdesc:set_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="structboost_1_1hana_1_1set.html" title="Basic unordered container requiring unique, Comparable and Hashable keys. ">boost::hana::set</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:size_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="size_8hpp.html">size.hpp</a></td></tr>
<tr class="memdesc:size_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#ga8ec3ac9a6f5014db943f61ebc9e1e36e" title="Equivalent to length; provided for consistency with the standard library.This method is an alias to l...">boost::hana::size</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:slice_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="slice_8hpp.html">slice.hpp</a></td></tr>
<tr class="memdesc:slice_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga245d8abaf6ba67e64020be51c8366081" title="Extract the elements of a Sequence at the given indices.Given an arbitrary sequence of indices...">boost::hana::slice</a></code> and <code><a class="el" href="group__group-Sequence.html#gae1f6a2a9cb70564d43c6b3c663b25dd7" title="Shorthand to slice a contiguous range of elements.slice_c is simply a shorthand to slice a contiguous...">boost::hana::slice_c</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:sort_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="sort_8hpp.html">sort.hpp</a></td></tr>
<tr class="memdesc:sort_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#gac000a79eb7b9d44ecc8982c93daa40e5" title="Sort a sequence, optionally based on a custom predicate.Given a Sequence and an optional predicate (b...">boost::hana::sort</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:span_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="span_8hpp.html">span.hpp</a></td></tr>
<tr class="memdesc:span_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga9bdde56d805517bce8e387f5bcd1887e" title="Returns a Product containing the longest prefix of a sequence satisfying a predicate, and the rest of the sequence.The first component of the returned Product is a sequence for which all elements satisfy the given predicate. The second component of the returned Product is a sequence containing the remainder of the argument. Both or either sequences may be empty, depending on the input argument. More specifically,. ">boost::hana::span</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:string_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="string_8hpp.html">string.hpp</a></td></tr>
<tr class="memdesc:string_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="structboost_1_1hana_1_1string.html" title="Compile-time string. ">boost::hana::string</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:suffix_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="suffix_8hpp.html">suffix.hpp</a></td></tr>
<tr class="memdesc:suffix_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-MonadPlus.html#ga61dab15f6ecf379121d4096fe0c8ab13" title="Inserts a value after each element of a monadic structure.Given a monadic structure xs and a value z ...">boost::hana::suffix</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:sum_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="sum_8hpp.html">sum.hpp</a></td></tr>
<tr class="memdesc:sum_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#ga650def4b2e98f4273d8b9b7aa5a2fc28" title="Compute the sum of the numbers of a structure.More generally, sum will take any foldable structure co...">boost::hana::sum</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:symmetric__difference_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="symmetric__difference_8hpp.html">symmetric_difference.hpp</a></td></tr>
<tr class="memdesc:symmetric__difference_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code>boost::hana::symmetric_difference</code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:take__back_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="take__back_8hpp.html">take_back.hpp</a></td></tr>
<tr class="memdesc:take__back_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga8d302de01b94b4b17f3bd81e09f42920" title="Returns the last n elements of a sequence, or the whole sequence if the sequence has less than n elem...">boost::hana::take_back</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:take__front_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="take__front_8hpp.html">take_front.hpp</a></td></tr>
<tr class="memdesc:take__front_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga5112e6070d29b4f7fde3f44825da3316" title="Returns the first n elements of a sequence, or the whole sequence if the sequence has less than n ele...">boost::hana::take_front</a></code> and <code><a class="el" href="group__group-Sequence.html#ga3779f62fea92af00113a9290f1c680eb" title="Equivalent to take_front; provided for convenience. ">boost::hana::take_front_c</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:take__while_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="take__while_8hpp.html">take_while.hpp</a></td></tr>
<tr class="memdesc:take__while_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga2d4db4ec5ec5bc16fe74f57de12697fd" title="Take elements from a sequence while the predicate is satisfied.Specifically, take_while returns a new...">boost::hana::take_while</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:tap_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="tap_8hpp.html">tap.hpp</a></td></tr>
<tr class="memdesc:tap_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Monad.html#ga5e0735de01a24f681c55aedfeb6d13bf" title="Tap inside a monadic chain.Given a function f, tap&lt;M&gt; returns a new function which performs f on its ...">boost::hana::tap</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:then_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="then_8hpp.html">then.hpp</a></td></tr>
<tr class="memdesc:then_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Monad.html#gaaddd3789de43cf989babb10cdc0b447a" title="Sequentially compose two monadic actions, discarding any value produced by the first but not its effe...">boost::hana::then</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:traits_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="traits_8hpp.html">traits.hpp</a></td></tr>
<tr class="memdesc:traits_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines function-like equivalents to the standard <code>&lt;type_traits&gt;</code>, and also to some utilities like <code>std::declval</code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:transform_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="transform_8hpp.html">transform.hpp</a></td></tr>
<tr class="memdesc:transform_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Functor.html#ga5a8975f6e55375d5b6038a9c36ee63e7" title="Map a function over a Functor. ">boost::hana::transform</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:tuple_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="tuple_8hpp.html">tuple.hpp</a></td></tr>
<tr class="memdesc:tuple_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="structboost_1_1hana_1_1tuple.html" title="General purpose index-based heterogeneous sequence with a fixed length. ">boost::hana::tuple</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:type_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="type_8hpp.html">type.hpp</a></td></tr>
<tr class="memdesc:type_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="structboost_1_1hana_1_1type.html" title="C++ type in value-level representation. ">boost::hana::type</a></code> and related utilities. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:unfold__left_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="unfold__left_8hpp.html">unfold_left.hpp</a></td></tr>
<tr class="memdesc:unfold__left_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#gaf2128be91ad6d32e45db1b8c61f79818" title="Dual operation to fold_left for sequences.While fold_left reduces a structure to a summary value from...">boost::hana::unfold_left</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:unfold__right_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="unfold__right_8hpp.html">unfold_right.hpp</a></td></tr>
<tr class="memdesc:unfold__right_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga497286bf277e6f8e89ddb18661e1033e" title="Dual operation to fold_right for sequences.While fold_right reduces a structure to a summary value fr...">boost::hana::unfold_right</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:union_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="union_8hpp.html">union.hpp</a></td></tr>
<tr class="memdesc:union_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code>boost::hana::union</code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:unique_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="unique_8hpp.html">unique.hpp</a></td></tr>
<tr class="memdesc:unique_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga35349be79e646c4f5bdd74ec96a846ab" title="Removes all consecutive duplicate elements from a Sequence.Given a Sequence and an optional binary pr...">boost::hana::unique</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:unpack_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="unpack_8hpp.html">unpack.hpp</a></td></tr>
<tr class="memdesc:unpack_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Foldable.html#ga7b0c23944364ce61136e10b978ae2170" title="Invoke a function with the elements of a Foldable as arguments.Given a function and a foldable struct...">boost::hana::unpack</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:value_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="value_8hpp.html">value.hpp</a></td></tr>
<tr class="memdesc:value_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Constant.html#ga1687520692a6b0c49e3a69de2980f388" title="Return the compile-time value associated to a constant.This function returns the value associated to ...">boost::hana::value</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:version_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="version_8hpp.html">version.hpp</a></td></tr>
<tr class="memdesc:version_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines macros for tracking the version of the library. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:while_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="while_8hpp.html">while.hpp</a></td></tr>
<tr class="memdesc:while_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Logical.html#ga08a767b86c330cac67daa891406d2730" title="Apply a function to an initial state while some predicate is satisfied.This method is a natural exten...">boost::hana::while_</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:zero_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="zero_8hpp.html">zero.hpp</a></td></tr>
<tr class="memdesc:zero_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Monoid.html#gad459ac17b6bab8ead1cae7de0032f3c6" title="Identity of plus. ">boost::hana::zero</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:zip_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="zip_8hpp.html">zip.hpp</a></td></tr>
<tr class="memdesc:zip_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#gaa5a378d4e71a91e0d6cd3959d9818e8a" title="Zip one sequence or more.Given n sequences s1, ..., sn, zip produces a sequence whose i-th element is...">boost::hana::zip</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:zip__shortest_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="zip__shortest_8hpp.html">zip_shortest.hpp</a></td></tr>
<tr class="memdesc:zip__shortest_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#gade78593b3ff51fc5479e1da97142fef5" title="Zip one sequence or more.Given n sequences s1, ..., sn, zip_shortest produces a sequence whose i-th e...">boost::hana::zip_shortest</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:zip__shortest__with_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="zip__shortest__with_8hpp.html">zip_shortest_with.hpp</a></td></tr>
<tr class="memdesc:zip__shortest__with_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#gae7a51104a77db79a0407d7d67b034667" title="Zip one sequence or more with a given function.Given a n-ary function f and n sequences s1...">boost::hana::zip_shortest_with</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:zip__with_8hpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="zip__with_8hpp.html">zip_with.hpp</a></td></tr>
<tr class="memdesc:zip__with_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines <code><a class="el" href="group__group-Sequence.html#ga6a4bf8549ce69b5b5b7377aec225a0e3" title="Zip one sequence or more with a given function.Given a n-ary function f and n sequences s1...">boost::hana::zip_with</a></code>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
</div><!-- contents -->
</div><!-- doc-content -->
<!--
Copyright Louis Dionne 2013-2016
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
-->
<!-- boost-no-inspect -->
<!-- HTML footer for doxygen 1.8.9.1-->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_daf74c896eae580804ddb7810f485dad.html">hana</a></li>
  </ul>
</div>
</body>
</html>
